Complexity of Interval Relaxed Numeric Planning
نویسندگان
چکیده
Automated planning is computationally hard even in its most basic form as STRIPS planning. We are interested in numeric planning with instantaneous actions, a problem that is not decidable in general. Relaxation is an approach to simplifying complex problems in order to obtain guidance in the original problem. We present a relaxation approach with intervals for numeric planning and show that plan existence can be decided in polynomial time for tasks where dependencies between numeric effects are acyclic.
منابع مشابه
Complexity Issues of Interval Relaxed Numeric Planning
Automated planning is a hard problem even in its most basic form as STRIPS planning. We are interested in numeric planning tasks with instantaneous actions, a problem which is not even decidable in general. Relaxation is an approach to simplifying complex problems in order to obtain guidance in the original problem. We present a relaxation approach with intervals for numeric planning and discus...
متن کاملA Hybrid Relaxed Planning Graph'LP Heuristic for Numeric Planning Domains
Effective search control for numeric planning domains, in which appropriate numeric resource usage is critical to solving the problem, remains an open challenge in domainindependent planning. Most real-world problems rely on metric resources such as energy, money, fuel or materials. Despite the importance of numbers, few heuristics have been proposed to guide search in such domains. Hoffmann’s ...
متن کاملPlanning with Numeric Varibles in Multiobjective Planning
The purely propositional representation traditionally used to express AI planning problems is not adequate to express numeric variables when modeling real-world continuous resources. This paper presents a heuristic planning approach that uses a richer representation with capabilities for numeric variables, including durations of actions, and multiobjective optimisation. The approach consists of...
متن کاملLPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PDDL3 preferences. Our focus is on computation of relaxed plan based heuristics that effectively guide a planner towards good solutions satisfying preferences. We build on the planner LPRPG, a hybrid relaxed planning graph (RPG)–linear programming (LP) approach. We make extensions to the RPG to rea...
متن کاملHandling Numeric Criteria in Relaxed Planning Graphs
Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graphplan-like expansion. Planners like FF or MIPS use this type of graphs in order to compute distance-based heuristics during the planning process. This paper presents a new approach to extend the functionality of these graphs in order to manage numeric optimization criter...
متن کامل